Learning Minor Closed Graph Classes with Membership and Equivalence Queries
نویسندگان
چکیده
The paper considers the problem of learning classes of graphs closed under taking minors It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries The representation of the class is in terms of a set of minimal excluded minors obstruction set
منابع مشابه
The Complexity of Learning Minor Closed Graph Classes
The paper considers the problem of learning classes of graphs closed under taking minors. It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation of the class is in terms of a set of minimal excluded minors (obstruction set). Moreover, a negative result for learning such classes using only equivalence queries is als...
متن کاملA Guide to Learning Arithmetic Circuits
An arithmetic circuit is a directed acyclic graph in which the operations are {+,×}. In this paper, we exhibit several connections between learning algorithms for arithmetic circuits and other problems. In particular, we show that: • Efficient learning algorithms for arithmetic circuit classes imply explicit exponential lower bounds. • General circuits and formulas can be learned efficiently wi...
متن کاملLimits on Exact Learning from Membership and Equivalence Queries
In this paper we look at different combinatorial properties of concept classes that give bounds on the query complexity of exact learning. We consider learning from equivalence queries, membership queries and a combination of equivalence and membership queries. We examine and present proofs regarding efficient query-learnability as it relates to the notions of polynomial certificates, approxima...
متن کاملThe graph of equivalence classes and Isoclinism of groups
Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$. In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$, where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$. We introduce a new graph determined ...
متن کاملOn Learning Branching Programs and Small Depth Circuits
This paper studies the learnability of branching programs and small depth circuits with modular and threshold gates in both the exact and PAC learning models with and without membership queries. Some of the results extend earlier works in GG95, ERR95, BTW95]. The main results are as follows. For branching programs we show the following. 1. Any monotone width two branching program (deened by Bor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995